Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup times embedded in the proposed model may vary in different machines based on their characteristics. This paper proposes a two-level mixed-integer programming for the given problem. By solving the presented model, the associated promising results show the effectiveness of this model for small and medium-sized problems, respectively.